منابع مشابه
Speeding up Fractal Image Compression
Fractal coding of digital images ooers many promising qualities. However the coding process suuers from the long search time of the domain block pool. In this paper, we obtain mathematical results on the distance measure used in the search. Then we derive an incremental procedure to bound the domain block pixels. We arrange the domain blocks in a tree structure, and utilise the procedure to dir...
متن کاملOn speeding up fractal image compression
In this work an improved classification algorithm is introduced, with the help of which the usually time consuming searching part of fractal image encoding speeds up considerably without loss of the reconstruction fidelity. Two parameters are used to sort image blocks into disjoint classes: the direction of the approximate first derivative and a normalized root mean square error of the fitting ...
متن کاملSpeeding up Queries in a Leaf Image Database
We have an Electronic Field Guide which contains an image database with thousands of leaf images. We have a system which can take a photo of a leaf and use this image to query the database and bring out a set of leaf images which have the most similar shape as the query leaves from different species. The existing query algorithm is based on a brute force approach, and it does not have a very at...
متن کاملSpeeding-Up Fractal Image Compression by Using Classification Range Blocks
In fractal compression technique, an image is partitioned into sub blocks called range blocks, each of which is encoded by matching it (after an appropriate affine transformation) with a block chosen from a large pool of domain blocks, which is constructed from the image itself. The problem is that the encoding is very time consuming because of the need to search in a very large domain pool. Ou...
متن کاملSpeeding-up Image Encoding times in the SPIHT Algorithm
In this paper, a new approach (scheme) to the analysis of quad-trees in the discrete wavelet spectrum of a digital image is proposed. During the pre-scanning phase, the proposed scheme generates problem-oriented binary codes for the whole set of quad-tree roots (wavelet coefficients) and thereby accumulates information on the significance of respective descendants (wavelet coefficients comprisi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Cytometry Part A
سال: 2014
ISSN: 1552-4922
DOI: 10.1002/cyto.a.22617